A GPU-Based Genetic Algorithm for the Multiple Allocation P-Hub Median Problem

As the sizes of realistic hub location problems increase as time goes on (reaching thousands nodes currently) this makes such difficult to solve in a reasonable using conventional computers. This study aims show that may be solved short computing and with high-quality solutions computational power GPU (actually available most personal computers). So, we present GPU-based approach for uncapacitated multiple allocations p-hub median problems. Our method identifies are likely hubs optimal solution improves them via parallel genetic algorithm. The obtained implementation reached within seconds or best all known benchmarks had access larger instances up 6000 so far unsolved. Compared study, no other article dealing has presented results large.